One-three join: A graph operation and its consequences
نویسندگان
چکیده
منابع مشابه
Indexing graph-structured XML data for efficient structural join operation
Structural join has been established as a primitive technique for matching the binary containment pattern, specifically the parent–child and ancestor–descendant relationship, on the tree XML data. While current indexing approaches and evaluation algorithms proposed for the structural join operation assume the tree-structured data model, the presence of reference links in XML documents may rende...
متن کاملk-Arbiter Join Operation
k-Arbiter is a useful concept for solving the distributed h-out of-k resources allocation problem. The distributed h-out of-k resources allocation algorithms based on k-arbiter have the benefits of high fault-tolerance and low communication cost. However, according to the definition of k-arbiter, it is required to have a non-empty intersection among any (k+1) quorums in a k-arbiter. Consequentl...
متن کاملترجمه و تحقیق کتاب three faiths- one god a jewish,christian muslim encouter
این کتاب شامل یازده فصل می باشد که سه فصل آن که حدوداً 83 صفحه می باشد، ترجمه شده است. در فصل اول بحثی در مورد خدا آغاز می شود و این بحث تا فصل سوم ادامه دارد و هر یک از نمایندگان سه دین یهودیت، مسیحیت و اسلام خدای خود را معرفی و اوصاف و ویژگیهای او را بازگو می کنند. در فصل اول فرد یهودی در مورد واقعیت مدرن ایمان یهودی و عمل و روابط بعنوان کلیدهایی برای ایمان، کسب معرفت به خدا از طریق وحی و دع...
15 صفحه اولSpectra of graphs obtained by a generalization of the join graph operation
Taking a Fiedler’s result [1] on the spectrum of a matrix formed from two symmetric matrices as a motivation, a more general result is deduced and applied to the determination of adjacency and Laplacian spectra of graphs obtained by a generalized join graph operation on families of graphs (regular in the case of adjacency spectra and arbitrary in the case of Laplacian spectra). Some additional ...
متن کاملOn the planarity of a graph related to the join of subgroups of a finite group
Let $G$ be a finite group which is not a cyclic $p$-group, $p$ a prime number. We define an undirected simple graph $Delta(G)$ whose vertices are the proper subgroups of $G$, which are not contained in the Frattini subgroup of $G$ and two vertices $H$ and $K$ are joined by an edge if and only if $G=langle H , Krangle$. In this paper we classify finite groups with planar graph. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2017
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1948